TSTP Solution File: NUM653^1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : NUM653^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 08:41:40 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   45 (  13 unt;  14 typ;   0 def)
%            Number of atoms       :  237 (  59 equ;   0 cnn)
%            Maximal formula atoms :    6 (   7 avg)
%            Number of connectives :  100 (  58   ~;  14   |;   4   &;   0   @)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   22 (  21   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  13 usr;   4 con; 0-6 aty)
%            Number of variables   :   26 (   0   ^  20   !;   0   ?;  26   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    nat: $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    nat: $tType ).

thf(func_def_1,type,
    x: nat ).

thf(func_def_2,type,
    y: nat ).

thf(func_def_3,type,
    less: nat > nat > $o ).

thf(func_def_5,type,
    more: nat > nat > $o ).

thf(func_def_8,type,
    kCOMB: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).

thf(func_def_9,type,
    bCOMB: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).

thf(func_def_10,type,
    vAND: $o > $o > $o ).

thf(func_def_11,type,
    vOR: $o > $o > $o ).

thf(func_def_12,type,
    vIMP: $o > $o > $o ).

thf(func_def_13,type,
    vNOT: $o > $o ).

thf(func_def_14,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(f84,plain,
    $false,
    inference(trivial_inequality_removal,[],[f83]) ).

thf(f83,plain,
    $true = $false,
    inference(forward_demodulation,[],[f81,f65]) ).

thf(f65,plain,
    ! [X0: nat] : ( $false = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X0) ),
    inference(trivial_inequality_removal,[],[f64]) ).

thf(f64,plain,
    ! [X0: nat] :
      ( ( $true != $true )
      | ( $false = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X0) ) ),
    inference(superposition,[],[f32,f7]) ).

thf(f7,plain,
    ! [X0: $o] :
      ( ( $true = X0 )
      | ( $false = X0 ) ),
    introduced(fool_axiom,[]) ).

thf(f32,plain,
    ! [X1: nat] : ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X1),X1) ),
    inference(equality_resolution,[],[f27]) ).

thf(f27,plain,
    ! [X0: nat,X1: nat] :
      ( ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) )
      | ( X0 != X1 ) ),
    inference(cnf_transformation,[],[f23]) ).

thf(f23,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( X0 != X1 )
        | ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) ) )
      & ( ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) )
        | ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ) )
      & ( ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) )
        | ( X0 != X1 ) ) ),
    inference(flattening,[],[f22]) ).

thf(f22,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( X0 != X1 )
        | ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) ) )
      & ( ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) )
        | ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ) )
      & ( ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) )
        | ( X0 != X1 ) ) ),
    inference(ennf_transformation,[],[f19]) ).

thf(f19,plain,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ) )
       => ( ( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) )
           => ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) ) )
         => ~ ( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) )
             => ( X0 != X1 ) ) ) ),
    inference(flattening,[],[f15]) ).

thf(f15,plain,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) ) )
       => ~ ~ ( ( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) )
               => ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) ) )
             => ~ ( ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) )
                 => ( X0 != X1 ) ) ) ),
    inference(fool_elimination,[],[f14]) ).

thf(f14,plain,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) )
       => ~ ~ ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1)
               => ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) )
             => ~ ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1)
                 => ( X0 != X1 ) ) ) ),
    inference(rectify,[],[f3]) ).

thf(f3,axiom,
    ! [X1: nat,X2: nat] :
      ~ ( ( ( X1 = X2 )
         => ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X1),X2) )
       => ~ ~ ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X1),X2)
               => ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X2) )
             => ~ ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X2)
                 => ( X1 != X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10b) ).

thf(f81,plain,
    $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),x),
    inference(backward_demodulation,[],[f24,f79]) ).

thf(f79,plain,
    x = y,
    inference(trivial_inequality_removal,[],[f76]) ).

thf(f76,plain,
    ( ( $true != $true )
    | ( x = y ) ),
    inference(superposition,[],[f75,f25]) ).

thf(f25,plain,
    ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,x),y) = $true )
    | ( x = y ) ),
    inference(cnf_transformation,[],[f20]) ).

thf(f20,plain,
    ( ( x = y )
    | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,x),y) = $true ) ),
    inference(ennf_transformation,[],[f17]) ).

thf(f17,plain,
    ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,x),y) != $true )
   => ( x = y ) ),
    inference(flattening,[],[f11]) ).

thf(f11,plain,
    ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,x),y) != $true )
   => ( x = y ) ),
    inference(fool_elimination,[],[f10]) ).

thf(f10,plain,
    ( ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,x),y)
   => ( x = y ) ),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    ( ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,x),y)
   => ( x = y ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).

thf(f75,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,x),y) != $true,
    inference(trivial_inequality_removal,[],[f71]) ).

thf(f71,plain,
    ( ( $true != $true )
    | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,x),y) != $true ) ),
    inference(superposition,[],[f28,f24]) ).

thf(f28,plain,
    ! [X0: nat,X1: nat] :
      ( ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,X0),X1) )
      | ( $true != vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X0),X1) ) ),
    inference(cnf_transformation,[],[f23]) ).

thf(f24,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) = $true,
    inference(cnf_transformation,[],[f16]) ).

thf(f16,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) = $true,
    inference(flattening,[],[f9]) ).

thf(f9,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y) != $true,
    inference(fool_elimination,[],[f8]) ).

thf(f8,plain,
    ~ ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y),
    inference(rectify,[],[f5]) ).

thf(f5,negated_conjecture,
    ~ ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y),
    inference(negated_conjecture,[],[f4]) ).

thf(f4,conjecture,
    ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),more,x),y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10d) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : NUM653^1 : TPTP v8.1.2. Released v3.7.0.
% 0.06/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n002.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 14:53:23 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (1923)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (1926)WARNING: value z3 for option sas not known
% 0.13/0.37  % (1927)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37  % (1928)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.37  % (1924)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37  % (1925)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37  % (1929)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.37  % (1926)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37  % (1930)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.37  % Exception at run slice level% Exception at run slice level% Exception at run slice level
% 0.13/0.37  
% 0.13/0.37  User error: User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructsFinite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.13/0.37  
% 0.13/0.37  
% 0.13/0.37  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.13/0.37  % (1930)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.13/0.37  % (1929)First to succeed.
% 0.13/0.37  % (1928)Also succeeded, but the first one will report.
% 0.13/0.37  % (1930)Also succeeded, but the first one will report.
% 0.13/0.37  % (1926)Also succeeded, but the first one will report.
% 0.13/0.37  % (1929)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1923"
% 0.13/0.37  % (1929)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37  % (1929)------------------------------
% 0.13/0.37  % (1929)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (1929)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (1929)Memory used [KB]: 774
% 0.13/0.37  % (1929)Time elapsed: 0.005 s
% 0.13/0.37  % (1929)Instructions burned: 6 (million)
% 0.13/0.37  % (1923)Success in time 0.009 s
%------------------------------------------------------------------------------